Method and system for fast determining time-delay stability margin of power system

ABSTRACT

The present disclosure discloses a method for fast determining a time-delay stability margin of a power system, which focuses on three steps, i.e., Jordan standardization, Taylor separation and Schur simplification, to reconstruct a new time delay system and reduce the system dimension. In this method, firstly, a time delay model is Jordan standardized; further, Taylor expansion is applied in a process for separating state variables with time delay from stage variables without time delay; then, balanced model reduction is realized by Schur simplification; and finally, a WSCC 3-generator-9-bus power system with multiple delays will be used to validate the proposed method via several typical criteria.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a national stage application of International Patent Application PCT/CN2016/097114, filed Aug. 29, 2016, which itself claims the priority to Chinese Patent Application No. CN 201610594776.x, filed Jul. 21, 2016 in the National Intellectual Property Administration of P.R. China, both of which are expressly incorporated by reference herein in their entirety.

Some references, which may include patents, patent applications, and various publications, are cited and discussed in the description of the present disclosure. The citation and/or discussion of such references is provided merely to clarify the description of the present disclosure and is not an admission that any such reference is “prior art” to the present disclosure described herein. All references cited and discussed in this specification are incorporated herein by reference in their entireties and to the same extent as if each reference was individually incorporated by reference.

TECHNICAL FIELD

The present invention relates to the technical field of Linear Matrix Inequality (LMI) and time-delay system stability analysis, and in particular relates to a method for fast determining a stability margin of a time-delay system.

BACKGROUND OF THE PRESENT DISCLOSURE

Wide Area Measurement System (WAMS), which is a real-time measuring system based on synchronous phasor measurement, aims to dynamically monitor, analyze and control bulk power systems. In the WAMS, the wide area control using the wide area measurement information is advantageous to improve the operating stability of the whole power system and realize the safe and stable operation of the power system. However, in the wide area control of power systems based on WAMS, since remote signals are required for feedback control, certain time delays exist in the wide area measurement signals, which may deteriorate the performance of controllers and result in the instability of the system. Therefore, it is essential to explore the impact of time delays from WAMS on the stability of power systems.

To explore the impact of time delays on the power systems, random variation of time delays, parameter incoherence, switching loops are taken into consideration. The direct method based on the Lyapunov stability theory and LMI has been widely used. In this method, the stability margin of the time-delay system can be directly obtained by constructing an energy function, so it is applied to the design of the controllers for time-delay systems and the like.

However, when the method is applied to the analysis and handling of time-delay problems in wide-area systems, the number of variables to be solved in this method is in an approximate square relationship with the number of state variables in the system. When there are more of state variables in the system, during the solution of the stability margin of the time-delay system, too many variables need to be solved, and the calculation time is too long. Therefore, how to decrease the number of variables to be solved and reduce the calculation time is very important. There have been some existing model simplification methods, such as, simplifying a complex system by a balanced reduction method through mean square root; and, for a non-minimum system, realizing model reduction by a Hankel minimum approximant simplification system and coprime factors. Those methods have successfully applied to the analysis of complicated dynamic systems. However, these existing simplification methods are mostly applied to systems without time delay. Due to the transcendental terms in the characteristic equations of time-delay systems, it is still very difficult to directly apply the existing simplification methods in the calculation process of the time delay stability.

Therefore, a heretofore unaddressed need exists in the art to address the aforementioned deficiencies and inadequacies.

SUMMARY OF THE PRESENT DISCLOSURE

To solve the above problems, the present disclosure provides a method for fast determining a time-delay stability margin of a power system. In this method, first, a system model with time delays is Jordan standardized; further, Taylor expansion is applied in the association separation of state variables with time delay from state variables without time delay; and then, balanced model reduction is realized by Schur simplification. Consequently, the calculation time of the time-delay stability margin is greatly reduced, and the accuracy of the final result of determination is ensured. Based on the Layapunov stability criteria, the time-delay stability margin of a WSCC 3-generator-9-bus power system is fast determined by the method of the present invention.

The present disclosure provides a method for fast determining a time-delay stability margin of a power system, wherein, for a time-delay power system with m time delays, a time-delay power system mathematical model is constructed and then simplified by Jordan standardization, Taylor separation and Schur simplification to obtain a simplified time-delay power system mathematical model, so that a time-delay stability margin of the time-delay power system is fast solved, and a maximum time delay that the power system can sustain without losing its stability is obtained, specifically:

step 1: constructing a time-delay power system mathematical model:

$\begin{matrix} \left\{ \begin{matrix} {{\frac{d{x(t)}}{dt} = {{A_{0}{x(t)}} + {\sum\limits_{i = 1}^{m}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}},{\tau_{i} > 0}} \\ {{{x\left( {t + \xi} \right)} = {h\left( {t,\xi} \right)}},{\xi \in \left\lbrack {{- {\max\left( \tau_{i} \right)}},0} \right)}} \end{matrix} \right. & (1) \end{matrix}$

where t is a time variable; x(t) is a state variable;

$\frac{d{x(t)}}{dt}$

is the derivative of the state variable versus time; A₀ is a non-delay coefficient matrix; A_(i) (where i=1, 2, . . . , m) is a delay coefficient matrix; m is the number of time delays; τ_(i) (where i=1, 2, . . . , m) is a delay constant of the system; τ_(i)>0 indicates that all time delays are greater than 0; x (t−τ_(i)) (where i=i=1, 2, . . . , m) is a delay state variable; h(t,ξ) is a historic trajectory of the state variable x(t); ξ∈[−max(τ_(i)),0) indicates that the variable ξ varies between the opposite number of the maximum value of τ_(i) and 0; and, all algebraic variables belong to a real number field R, and all vector variables belong to an n-dimensional real number vector R^(n);

step 2: summing up delay coefficient matrices A_(i) (where A_(i), i=1, 2, . . . , m) in the step 1 and performing Jordan standardization by the sparity of the delay coefficient matrices, and performing row-column transformation on the time-delay power system mathematical model according to the sparity;

step 3: performing Taylor expansion on the delay state variable {tilde over (z)}(t−τ_(i)) subjected to the row-column transformation in the step 2, separating the correlation between the non-delay variable {tilde over (z)}(t) and the delay variable {tilde over (z)}(t−τ_(i)) in the time-delay power system mathematical model after the Jordan standardization and the sparity row-column transformation;

step 4: simplifying the time-delay power system mathematical model by a Schur model, so that the number of state variables is decreased from n to r, and obtaining a simplified time-delay power system mathematical model; and

step 5: based on the time-delay stability criteria for the power system, obtaining the time-delay stability margin of the time-delay power system with m time delays by the simplified time-delay power system mathematical model obtained in the step 4, thus achieving the fast determination of the time-delay stability margin of the power system, and obtaining the maximum time delay that the power system can sustain without losing its stability.

Compared with the prior art, the present application has the following beneficial effects.

For a wide-area power system with multiple time delays, the present invention provides a method for fast determining the time-delay stability margin of the power system (also referred to as JTS fast solution), which uses Jordan standardization, Taylor separation and Schur simplification to simplify the model for the time-delay power system. The simplified model can be suitable for various time-delay stability criteria. Thus, the calculation efficiency can be greatly enhanced, and the calculation performance can be improved.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings illustrate one or more embodiments of the present invention and, together with the written description, serve to explain the principles of the invention. Wherever possible, the same reference numbers are used throughout the drawings to refer to the same or like elements of an embodiment.

FIG. 1 is a diagram showing the time-delay stability margin of a WSCC 3-generator-9-bus power system which is directly calculated through three criteria;

FIG. 2 is a diagram showing the time-delay stability margin of the WSCC 3-generator-9-bus power system which is calculated by a JTS fast solution method of the present invention through three criteria;

FIG. 3 is a flowchart illustrating a method of fast determining a time-delay stability margin of a power system; and

FIG. 4 is a block diagram illustrating a computing system in which the present system and method can operate.

DETAILED DESCRIPTION OF THE PRESENT DISCLOSURE

The technical solutions of the present invention will be further described below in detail by specific embodiments with reference to the accompanying drawings. The specific embodiments to be described are merely for explaining the present invention, rather than limiting the present invention.

The present disclosure provides a method for fast determining a time-delay stability margin of a power system, wherein, for a time-delay power system with m time delays, a time-delay power system mathematical model is constructed and then simplified by Jordan standardization, Taylor separation and Schur simplification to obtain a simplified time-delay power system mathematical model, so that a time-delay stability margin of the time-delay power system is fast solved, and it is determined according to the time-delay stability margin whether the currently operated power system is stable, specifically:

Step 1: constructing a time-delay power system mathematical model, specifically:

Step 1-1: in a WSCC 3-generator-9-bus system, generators 2, 3 are treated as equivalent units of powder grid with wide-area control loop; assuming that a time delay τ₁ exists in the feedback of the terminal voltage measured on a bus 2 to an excitation regulator, and a time delay τ₂ exists in the feedback of the terminal voltage measured on a bus 3 to the excitation regulator, constructing a differential algebraic equation set of the power system with time delays:

$\begin{matrix} {\left\{ \begin{matrix} {\overset{.}{s} = {f\left( {s,s_{1},s_{2},y,y_{1},y_{2}} \right)}} \\ {0 = {g\left( {s,y} \right)}} \\ {{0 = {g\left( {s_{i},y_{i}} \right)}},\ {i = 1},2} \end{matrix} \right.,} & (1) \end{matrix}$

where s∈R^(n) is an original state variable of the system, y∈R^(r) is an original algebraic variable of the system, s_(i)=s (t−τ_(i)) (where i=1, 2) is an original delay state variable of the system, y_(i)=y (t−τ_(i)) (where i=1, 2) is an original delay algebraic variable of the system; and, τ_(i)∈R (where i=1, 2) is a time delay constant of the system.

Step 1-2: linearizing the equation (2) in an equilibrium point (x_(e), y_(e)) to obtain:

$\begin{matrix} \left\{ {\begin{matrix} {{\Delta\overset{.}{s}} = {{F_{s}\Delta\; s} + {F_{y}\Delta y} + {\Sigma_{i = 1}^{2}\left( {{F_{si}\Delta s_{i}} + {F_{yi}\Delta y_{i}}} \right)}}} \\ {0 = {{G_{s}\Delta s} + {G_{y}\Delta y}}} \\ {{0 = {{G_{si}\Delta s_{i}} + {G_{yi}\Delta y_{i}}}},{i = 1},2} \end{matrix},{{{where}F_{z}} = \frac{\partial f}{\partial z}},{F_{y} = \frac{\partial f}{\partial y}},{G_{z} = \frac{\partial g}{\partial z}},{G_{y} = \frac{\partial g}{\partial y}},{F_{zi} = \frac{\partial f}{\partial z_{i}}},{F_{yi} = \frac{\partial f}{\partial y_{i}}},{G_{zi} = \frac{\partial g}{\partial z_{i}}},{{{and}\mspace{14mu} G_{yi}} = \frac{\partial g}{\partial y_{i}}},} \right. & (2) \end{matrix}$

where i=1, 2;

Step 1-3: without considering the singularity, G_(y) and G_(yi) in the equation (2) are invertible, expressing the equation (2) as:

Δ{dot over (s)}=A ₀ Δs+Σ _(i=1) ^(m) A _(i) Δs(t−τ _(i))  (3),

where A₀=F_(s)−F_(y)G_(y) ⁻¹G_(s) and A_(i)=F_(si)−F_(yi)G_(yi) ⁻¹G_(si);

Step 1-4: expressing the increment of the state variable by x(t)=Δz, rewriting the equation (3) as:

$\begin{matrix} {{\frac{{dx}(t)}{dt} = {{A_{0}{x(t)}} + {\sum\limits_{i = 1}^{2}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}};} & (4) \end{matrix}$

Step 1-5: expressing the time-delay power system mathematical model as follows:

$\begin{matrix} \left\{ {\begin{matrix} {{\frac{d{x(t)}}{dt} = {{A_{0}{x(t)}} + {\sum\limits_{i = 1}^{2}{A_{i}{x\left( {t - \tau_{t}} \right)}}}}},{\tau_{i} > 0}} \\ {{{x\left( {t + \xi} \right)} = {h\left( {t,\xi} \right)}},{\xi \in \left\lbrack {{- {\max\left( \tau_{i} \right)}},0} \right)}} \end{matrix},} \right. & (5) \end{matrix}$

where t is a time variable; x(t) is a state variable;

$\frac{d{x(t)}}{dt}$

is the derivative of the state variable with regard to the time; h(t,ξ) is a historic trajectory of the state variable x(t); ξ∈[−max(τ_(i)),0) indicates that the variable ξ varies between the opposite number of the maximum value of τ_(i) and 0; all algebraic variables belong to a real number field R, and all vector variables belong to a 10-dimensional real number vector R¹⁰; and, the specific numerical values of the non-delay coefficient matrix A₀ and delay coefficient matrix A₁ and A₂ are as follows:

$\begin{matrix} {{A_{0} = {{\begin{bmatrix} A_{11}^{0} & A_{12}^{0} \\ A_{21}^{0} & A_{22}^{0} \end{bmatrix}\mspace{11mu} A_{11}^{0}} = \left\lbrack \begin{matrix} 0.00 & 377.00 & 0.00 & 0.00 & 0.00 \\ {{- {0.1}}5} & {- 0.00} & {{- {0.0}}3} & {{- {0.1}}1} & 0.00 \\ {{- {0.0}}2} & 0.00 & {- 0.26} & {{0.0}5} & {{0.1}7} \\ {- 1.87} & 0.00 & 0.24 & {- 5.02} & 0.00 \\ 0 & 0.00 & {- 2309.00} & 9592.00 & {- 50.00} \end{matrix} \right\rbrack}},{A_{12}^{0} = {{\begin{bmatrix} {000} & 0.00 & {{0.0}0} & {{0.0}0} & {{0.0}0} \\ {{0.1}0} & 0.00 & {{0.1}1} & {{0.0}6} & {{0.0}0} \\ {{0.1}5} & 0.00 & 0.46 & {{0.0}1} & {{0.0}0} \\ 0.92 & 0.00 & {{0.2}6} & {{0.7}5} & {{0.0}0} \\ 0.00 & 0.00 & {{0.0}0} & {{0.0}0} & {{0.0}0} \end{bmatrix}A_{21}^{0}} = {{\begin{bmatrix} 0.00 & {{0.0}0} & 0.00 & {{0.0}0} & 0.00 \\ 0.21 & {{0.0}0} & {{0.1}9} & {{0.1}2} & 0.00 \\ {{0.1}3} & {{0.0}0} & {{0.3}5} & {{0.0}2} & 0.00 \\ {{2.4}1} & {{0.0}0} & {{0.4}3} & 1.85 & 0.00 \\ {{- 2}5{0.8}0} & {{0.0}0} & {- 814.20} & 13.59 & 0.00 \end{bmatrix}A_{21}^{0}} = \left\lbrack \begin{matrix} 0.00 & {377} & 0.00 & 0.00 & 0.00 \\ {{- {0.3}}6} & {{- {0.0}}1} & {{- {0.0}}9} & {{- {0.3}}0} & 0.00 \\ {{- {0.0}}1} & 0.00 & {{- {0.1}}4} & {{0.0}2} & {{0.1}3} \\ {- 5.69} & 0.00 & {{- {0.2}}4} & {{- 1}4.22} & 0.00 \\ {{- 1}39.90} & 0.00 & {240{2.9}2} & 486.00 & {- 50.00} \end{matrix} \right\rbrack}}}} & (6) \\ {{{A_{1} = \begin{bmatrix} A_{11}^{1} & A_{12}^{1} \\ A_{21}^{1} & A_{22}^{1} \end{bmatrix}}{A_{11}^{1} = \begin{bmatrix} 0.00 & 0.00 & 0.00 & 0.00 & {{0.0}0} \\ 0.00 & 0.00 & 0.00 & 0.00 & {{0.0}0} \\ 0.00 & 0.00 & 0.00 & {{0.0}2} & {{0.0}0} \\ 0.00 & 0.00 & 0.00 & 0.00 & {{0.0}0} \\ {- 2358.00} & 0.00 & 2272.00 & {{- 5}93.70} & {{0.0}0} \end{bmatrix}},{A_{12}^{1} = \begin{bmatrix} 0.00 & 0.00 & 0.00 & {{0.0}0} & {{0.0}0} \\ 0.00 & 0.00 & 0.00 & {{0.0}0} & {{0.0}0} \\ 0.00 & 0.00 & 0.00 & {{0.0}0} & {{0.0}0} \\ 0.00 & 0.00 & 0.00 & {{0.0}0} & {{0.0}0} \\ {{- 1}73.70} & 0.00 & {{- 9}4{2.8}0} & {8{7.0}0} & {{0.0}0} \end{bmatrix}}}{{A_{21}^{1} = O_{5 \times 5}},\mspace{11mu}{A_{22}^{1} = O_{5 \times 5}}}} & (7) \\ {{{A_{2} = {{\begin{bmatrix} A_{11}^{2} & A_{12}^{2} \\ A_{21}^{2} & A_{22}^{2} \end{bmatrix}\mspace{14mu} A_{11}^{2}} = O_{9 \times 5}}},{A_{12}^{2} = O_{9 \times 5}}}{{A_{21}^{2} = \left\lbrack {{{- 2}5{0.8}0\mspace{20mu} 0.00}\mspace{14mu} - {81{4.2}0\mspace{14mu} 13.5\; 9\mspace{14mu} 0.00}} \right\rbrack},{A_{22}^{2} = {\left\lbrack {{{- 1}2{3.9}0\mspace{20mu} 0.00\mspace{14mu} 32.49}\mspace{14mu} - {34{3.2}0\mspace{14mu} 0.00}} \right\rbrack.}}}} & (8) \end{matrix}$

Step 2: summing up delay coefficient matrices A_(i) (where i=1, 2) in the time-delay power system mathematical model and performing Jordan standardization by the sparity of the delay coefficient matrices A₁, A₂, and performing row-column transformation according to the sparity, specifically:

Step 2-1: accumulating the delay coefficient matrix A_(i) (where i=1, 2) to obtain

$\sum\limits_{i = 1}^{2}{A_{i}.}$

Step 2-2: performing a Jordan standardization to the result of accumulation

${\sum\limits_{i = 1}^{m}A_{i}},$

that is, performing row-column transformation on the sum of the delay coefficient matrix A_(i) (where i=1, 2):

$\begin{matrix} {{{{T\left( {\sum\limits_{i = 1}^{m}A_{i}} \right)}T^{- 1}} = J},} & (9) \end{matrix}$

where T is a row-column transformation matrix;

Step 2-3: performing a row-row transformation on the first equation

$\frac{{dx}(t)}{dt} = {{A_{0}{x(t)}} + {\sum\limits_{i = 1}^{2}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}$

constructed in the step 1 to obtain:

$\begin{matrix} {{\frac{dT{x(r)}}{dt} = {{TA_{0}{x(t)}} + {T{\sum\limits_{i = 1}^{2}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}}};} & (10) \end{matrix}$

Step 2-4: performing a variable substitution on the state variable x(t) setting Tx(t)=z(t), and substituting x(t)=T⁻¹z(t) and x(t−τ_(i))=T⁻¹z(t−τ_(i)) into the equation (10) to obtain:

$\begin{matrix} {{\frac{d{z(t)}}{dt} = {{A_{0J}{z(t)}} + {\sum\limits_{i = 1}^{2}{A_{iJ}{z\left( {t - \tau_{i}} \right)}}}}};} & (11) \end{matrix}$

Step 2-5: according to the sparity of the delay coefficient matrix A_(iJ) in the equation (11), performing row-column transformation on the delay coefficient matrix A_(iJ) based on the following transformation rule: for any variable z_(k) (where 1≤k≤10), if the value of an element A_(iJ) (i, j) or A_(iJ) (j,i) (where 1≤i≤2 and 1≤j≤10) in A_(iJ) is 0, successively arranging the variable z_(k) as the last variable in the sequence of stage variables to obtain a rearranged state variable {tilde over (z)}(t)=[{tilde over (z)}^(T) _(res) (t) {tilde over (z)}^(T) _(unres)(t)]^(T), where {tilde over (z)}_(res)(t)∈R⁴ and {tilde over (z)}_(unres)(t)∈R⁶; hence, obtaining the following equation according to the transformation rule:

$\begin{matrix} {{\begin{bmatrix} {{\overset{.}{\overset{˜}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{˜}{z}}}_{unres}(t)} \end{bmatrix} = {{{\overset{\sim}{A}}_{0}\begin{bmatrix} {{\overset{˜}{z}}_{res}(t)} \\ {{\overset{˜}{z}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{i = 1}^{2}{{\overset{˜}{A}}_{i}\begin{bmatrix} {{\overset{˜}{z}}_{res}\left( {t - \tau_{i}} \right)} \\ {{\overset{˜}{z}}_{unres}\left( {t - \tau_{i}} \right)} \end{bmatrix}}}}},} & (12) \end{matrix}$

where

$\begin{matrix} {{{\overset{˜}{A}}_{i} = \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix}};} & \; \end{matrix}$

The time-delay power system mathematical model subjected to the Jordan standardization and sparity row-column transformation is expressed as follows:

$\begin{matrix} \left\{ {\begin{matrix} {{\frac{d\overset{\sim}{z}(t)}{dt} = {{{\overset{˜}{A}}_{0}{\overset{˜}{z}(t)}} + {\sum\limits_{i = 1}^{2}{{\overset{˜}{A}}_{i}{\overset{˜}{z}\left( {t - \tau_{i}} \right)}}}}},{\tau_{i} > 0}} \\ {{{\overset{˜}{z}\left( {t + \xi} \right)} = {\overset{˜}{h}\left( {t,\xi} \right)}},{\xi \in \left\lbrack {{- \tau_{i}},0} \right)}} \end{matrix};} \right. & (13) \end{matrix}$

Step 3: performing a Taylor expansion on the delay state variable {tilde over (z)}(t−τ_(i)) subjected to the row-column transformation in the step 2, separating the correlation between the non-delay variable {tilde over (z)}(t) and the delay variable {tilde over (z)}(t−τ_(i)) in the time-delay power system mathematical model after the Jordan standardization and the sparity row-column transformation.

Step 3-1: performing a Taylor expansion on the delay state variable {tilde over (Z)}res(t−τ_(i)) in the equation (13):

$\begin{matrix} {\begin{bmatrix} {{\overset{˜}{z}}_{res}\left( {t - \tau_{i}} \right)} \\ {{\overset{˜}{z}}_{unres}\left( {t - \tau_{i}} \right)} \end{bmatrix} = {\begin{bmatrix} {{\overset{˜}{z}}_{res}(t)} \\ {{\overset{˜}{z}}_{unres}(t)} \end{bmatrix} - {\tau_{i}\begin{bmatrix} {{\overset{.}{\overset{˜}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{˜}{z}}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{l = 2}^{\infty}{{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{˜}{z}}_{res}^{(l)}(t)} \\ {{\overset{˜}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}.}}}} & (14) \end{matrix}$

Step 3-2: substituting the first equation

$\frac{d{\overset{\sim}{z}(t)}}{dt} = {{{\overset{˜}{A}}_{0}{\overset{˜}{z}(t)}} + {\sum\limits_{i = 1}^{2}{{\overset{˜}{A}}_{i}{\overset{˜}{z}\left( {t - \tau_{i}} \right)}}}}$

in the equation (13) into the equation (14) to obtain:

$\begin{matrix} {{\begin{bmatrix} {{\overset{.}{\overset{˜}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{˜}{z}}}_{unres}(t)} \end{bmatrix} = {{{\overset{\sim}{A}}_{0}\begin{bmatrix} {{\overset{˜}{z}}_{res}(t)} \\ {{\overset{˜}{z}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{i = 1}^{2}{{\overset{\sim}{A}}_{i}\left\{ {\begin{bmatrix} {{\overset{˜}{z}}_{res}(t)} \\ {{\overset{˜}{z}}_{unres}(t)} \end{bmatrix} - {\tau_{i}\begin{bmatrix} {{\overset{.}{\overset{˜}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{˜}{z}}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{l = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{˜}{z}}_{res}^{(l)}(t)} \\ {{\overset{˜}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}}} \right\}}}}};} & (15) \end{matrix}$

Step 3-3: combining similar variables in the equation (15):

$\begin{matrix} {{\left\{ {I_{10 \times 10} + {\sum\limits_{i = 1}^{2}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix}}}} \right\} \cdot \begin{bmatrix} {{\overset{.}{\overset{˜}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{˜}{z}}}_{unres}(t)} \end{bmatrix}}{{{\bullet\bullet} = {{\left\{ {{\overset{˜}{A}}_{0} + {\sum\limits_{i = 1}^{2}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix}}} \right\} \cdot \begin{bmatrix} {{\overset{˜}{z}}_{res}(t)} \\ {{\overset{˜}{z}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{i = 1}^{2}{\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix} \cdot \left\{ {\sum\limits_{i = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{˜}{z}}_{res}^{(l)}(t)} \\ {{\overset{˜}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}} \right\}}}}},}} & (16) \end{matrix}$

where, since

$\left\{ {I_{10 \times 10} + {\sum\limits_{i = 1}^{2}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix}}}} \right\}$

is invertible, multiplying both sides of the equation (16) by the inverse matrix of

$\left\{ {I_{10 \times 10} + {\sum\limits_{i = 1}^{2}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & o_{6 \times 6} \end{bmatrix}}}} \right\}$

to obtain a time-delay power system mathematical model subjected to the Taylor separation:

$\begin{matrix} {\begin{bmatrix} {{\overset{.}{\overset{˜}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{˜}{z}}}_{unres}(t)} \end{bmatrix} = {{{\left\{ {I_{10 \times 10} + {\sum\limits_{i = 1}^{2}{\tau_{i}\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix}}}} \right\}^{- 1} \cdot \left\{ {{\overset{˜}{A}}_{0} + {\sum\limits_{i = 1}^{2}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix}}} \right\} \cdot \left\lbrack \begin{matrix} {{\overset{˜}{z}}_{res}(t)} \\ {{\overset{˜}{z}}_{unres}(t)} \end{matrix} \right\rbrack} + {\left\{ {I_{10 \times 10} + {\sum\limits_{i = 1}^{2}{\tau_{i}\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix}}}} \right\}^{- 1} \cdot {\sum\limits_{i = 1}^{2}{\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix} \cdot \left\{ {\sum\limits_{i = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{˜}{z}}_{res}^{(l)}(t)} \\ {{\overset{˜}{z}}_{unres}^{l}(t)} \end{bmatrix}}} \right\}}}}} = {{\left\{ {I_{10 \times 10} + {\sum\limits_{i = 1}^{2}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ o_{6 \times 4} & O_{6 \times 6} \end{bmatrix}}}} \right\}^{- 1} \cdot \left\{ {{\overset{˜}{A}}_{0} + {\sum\limits_{i = 1}^{2}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix}}} \right\} \cdot \begin{bmatrix} {{\overset{˜}{z}}_{res}(t)} \\ {{\overset{˜}{z}}_{unres}(t)} \end{bmatrix}} + {\left\{ {I_{10 \times 10} + {\sum\limits_{i = 1}^{2}{\tau_{j}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix}}}} \right\}^{- 1} \cdot {\sum\limits_{i = 1}^{2}{\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} \\ O_{6 \times 4} \end{bmatrix} \cdot {\left\{ {\sum\limits_{i = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{˜}{z}}_{res}^{(l)}(t)} \\ {{\overset{˜}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}} \right\}.}}}}}}} & (17) \end{matrix}$

Step 4: simplifying the time-delay power system mathematical model by Schur simplification, so that the number of state variables is decreased from 10 to 4, and obtaining a simplified time-delay power system mathematical model, specifically:

Step 4-1: converting the time-delay power system mathematical model into an input-output form:

$\begin{matrix} \left\{ {\begin{matrix} {{\overset{.}{\overset{\sim}{z}}(t)} = {{{\overset{\_}{A}}_{0}{\overset{\sim}{z}(t)}} + {{\overset{\_}{B}}_{0}{u(t)}}}} \\ {{y(t)} = {\left\lbrack {I_{4 \times 4}\mspace{14mu} O_{4 \times 6}} \right\rbrack{\overset{\sim}{z}(t)}}} \end{matrix},{{{where}\text{:}{\overset{\_}{A}}_{0}} = {{{\left\{ {I_{10 \times 10} + {\sum\limits_{i = 1}^{2}{\tau_{i}\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix}}}} \right\}^{- 1} \cdot \left\{ {{\overset{˜}{A}}_{0} + {\sum\limits_{i = 1}^{2}\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix}}} \right\}}{\overset{\_}{B}}_{0}} = {{\left\lbrack {{\overset{\_}{B}}_{1}\mspace{14mu}{\overset{\_}{B}}_{2}} \right\rbrack{\overset{\_}{B}}_{i}} = {\left\{ {I_{10 \times 10} + {\sum\limits_{i = 1}^{2}{\tau_{i}\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{4 \times 6} \\ O_{6 \times 4} & O_{6 \times 6} \end{bmatrix}}}} \right\}^{- 1} \cdot {\sum\limits_{i = 1}^{2}\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} \\ O_{6 \times 4} \end{bmatrix}}}}}},{i = 1},{{2u} = \left\lfloor {u_{1}^{T}\mspace{14mu} u_{2}^{T}} \right\rfloor},{i = 1},2,{{u_{i}(t)} = {\sum\limits_{l = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}{{{\overset{˜}{z}}_{res}^{(i)}(t)}.}}}}} \right. & (18) \end{matrix}$

Step 4-2: performing Schur simplification in the equation (18) to decrease the number of state variables from 10 to 4:

$\begin{matrix} \left\{ {\begin{matrix} {{{\overset{.}{z}}_{red}(t)} = {{A_{red}{z_{red}(t)}} + {B_{red}{u(t)}}}} \\ {{y(t)} = {C_{red}{z_{red}(t)}}} \end{matrix},} \right. & (19) \end{matrix}$

where z_(red)(t)∈R⁴, y(t)∈R⁴, A_(red)∈R^(4×4), B_(red,i)∈R^(4×4), C_(red)∈R^(4×4), and B_(red)=[B_(red,1) B_(red,2)].

Step 4-3: in accordance with the equation (18), substituting y(t)={tilde over (z)}_(res)(t) into the equation (19):

$\begin{matrix} \left\{ {\begin{matrix} {{{\overset{.}{z}}_{red}(t)} = {{A_{red}{z_{red}(t)}} + {B_{red}{u(t)}}}} \\ {{{\overset{\sim}{z}}_{rez}(t)} = {C_{red}{z_{red}(t)}}} \end{matrix};} \right. & (20) \end{matrix}$

Step 4-4: substituting the second equation {tilde over (z)}_(res)(t)=C_(red)z_(red)(t) in the equation (20) into the first equation ź_(red)(t)=A_(red)z_(red)(t)+B_(red)u(t) to obtain:

$\begin{matrix} {{{\overset{.}{\overset{\sim}{z}}}_{res}(t)} = \left. {{C_{red}A_{red}C_{red}^{- 1}{{\overset{\sim}{z}}_{res}(t)}} + {C_{red}B_{red}{u(t)}}} \middle| . \right.} & (21) \end{matrix}$

Step 4-5: expanding each input component u_(i)(t) of input u(t) in the equation (18) according to the Taylor separation:

$\begin{matrix} {{{u_{i}(t)} = {\sum\limits_{l = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}{{\overset{˜}{z}}_{res}^{(j)}(t)}}}}{{u_{i}(t)} = {{\sum\limits_{l = 0}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}{{\overset{˜}{z}}_{res}^{(l)}(t)}}} - {{\overset{˜}{z}}_{res}^{(0)}(t)} - {\frac{\left( {- \tau_{i}} \right)^{1}}{1!}{{\overset{\sim}{z}}_{res}^{(1)}(t)}}}}{{u_{i}(t)} = {{{\overset{\sim}{z}}_{res}\left( {t - \tau_{i}} \right)} - {{\overset{\sim}{z}}_{res}(t)} + {\tau_{i}{{{\overset{.}{\overset{\sim}{z}}}_{res}(t)}.}}}}} & (22) \end{matrix}$

Step 4-6: substituting all input components into the equation (21) to obtain a simplified time-delay power system mathematical model:

$\begin{matrix} \left\{ {\begin{matrix} {\frac{d{\overset{\sim}{z}}_{\;_{res}}(t)}{dt} = {{A_{0,{res}}{{\overset{\sim}{z}}_{res}(t)}} + {\sum\limits_{i = 1}^{2}{A_{i,{res}}{{\overset{˜}{z}}_{res}\left( {t - \tau_{i}} \right)}}}}} \\ {{{x\left( {t + \xi} \right)} = {h\left( {t,\xi} \right)}},{\xi \in \left\lbrack {{- {\max\left( \tau_{i} \right)}},0} \right)}} \end{matrix},{{{where}\text{:}A_{0,{res}}} = {\left( {I_{4 \times 4} - {\sum\limits_{i = 1}^{2}{\tau_{i}C_{red}B_{{red},i}}}} \right)^{- 1}\left( {{C_{red}A_{red}C_{red}^{- 1}} - {\sum\limits_{i = 1}^{2}{C_{red}B_{{red},i}}}} \right)}},{{A_{i,{res}} = {\left( {I_{r \times r} - {\sum\limits_{i = 1}^{2}{\tau_{i}C_{red}B_{{red},i}}}} \right)^{- 1}C_{red}B_{{red},i}}};}} \right. & (23) \end{matrix}$

Step 5: based on the time-delay stability criteria for the power system, obtaining the time-delay stability margin of the time-delay power system with 2 time delays by the simplified time-delay power system mathematical model obtained in the step 4, thus obtaining the maximum time delay allowed for the stable operation of the power system. The time-delay stability criteria for the power system include one of the following situations:

(1) Layapunov stability criteria; and

(2) Eigenvalue analysis stability criteria.

The effects of the method will be described below by taking three specific Layapunov stability criteria as example.

The time-delay stability margin of the WSCC 3-generator-9-bus power system with two time delays is obtained by the simplified time-delay power system mathematical model obtained in the step 4, and the results obtained by the JTS fast solution method of the present invention are compared with the results directly obtained by the criteria. Three typical criteria among the Layapunov stability criteria will be specifically described as below.

Criterion 1 is a multi-delay stability criterion for the power system containing free-weighting matrices.

Criterion 1: For a system with m time delays, if there exist positive definite matrices P∈R^(n×n) and Q_(i)∈R^(n×n) (where i=1, 2, . . . , m), semi-positive definite matrices W_(i,j)∈R^(n×x), symmetric matrices X_(i,j)∈R^((m+1)n×(m+1)n) (where 0≤i<j<m) and proper matrices N_(k) ^(i,j)∈R^(n×n) (where 0≤i<j<m and i=1, 2, . . . , m, m+1), the following matrix inequality is established:

$\begin{matrix} {S = {\begin{bmatrix} S_{1,1} & \ldots & S_{1,m} & S_{1,{m + 1}} \\ \vdots & \ddots & \ldots & \ldots \\ S_{1,m}^{T} & \vdots & S_{m,m} & S_{m,{m + 1}} \\ S_{1,{m + 1}}^{T} & \vdots & S_{m,{m + 1}}^{T} & S_{{m + 1},{m + 1}} \end{bmatrix} < O}} & (28) \\ {{{M_{i,j} \geq O},{0 \leq i < j < m},{{where}\text{:}}}{S_{1,1} = {{PA}_{0} + {A_{0}^{T}P} + {\sum\limits_{k = 1}^{m}Q_{k}} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)A_{0}^{T}W_{k,l}A_{0}}}} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)X_{1,1}^{k,l}}}} + {\sum\limits_{k = 1}^{m}N_{1}^{0,k}} + {\sum\limits_{k = 1}^{m}\left( N_{1}^{0,k} \right)^{T}}}}} & (29) \\ {S_{{m + 1},{m + 1}} = {{- Q_{m}} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)A_{m}^{T}W_{k,l}A_{m}}}} - {\sum\limits_{k = 0}^{m - 1}N_{m}^{k,m}} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)X_{{m + 1},{m + 1}}^{k,l}}}} - {\sum\limits_{k = 0}^{m - 1}\left( N_{m}^{k,m} \right)^{T}}}} & \; \\ {{S_{i,i} = {{- Q_{i - 1}} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)A_{i - 1}^{T}W_{k,l}A_{i - 1}}}} + {\sum\limits_{k = i}^{m}N_{i}^{{i - 1},k}} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)X_{i,i}^{k,l}}}} + {\sum\limits_{k = i}^{m}\left( N_{i}^{{i - 1},k} \right)^{T}} - {\sum\limits_{k = 0}^{i - 2}N_{i}^{k,{i - 1}}} - {\sum\limits_{k = 0}^{i - 2}\left( N_{i}^{k,{i - 1}} \right)^{T}}}},{i = 2},3,\ldots\mspace{14mu},{m - 1},m} & \; \\ {{S_{1,j} = {{{{{PA}_{j - 1}++}{\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)A_{0}^{T}W_{k,l}A_{j - 1}}}}} + {\sum\limits_{k = j}^{m}N_{1}^{{j - 1},k}} - {\sum\limits_{k = 0}^{j - 2}N_{1}^{k,{j - 1}}} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)X_{1,j}^{k,l}}}} + {\left( {\sum\limits_{k = i}^{m}N_{j}^{0,k}} \right)^{T}i}} = 2}},3,\ldots\mspace{14mu},m,m} & \; \\ {{S_{i,j} = {{{\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)A_{i - 1}^{T}W_{k,l}A_{j - 1}}}} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)X_{i,j}^{k,l}}}} + {\sum\limits_{k = j}^{m}N_{i}^{{j - 1},k}} - {\sum\limits_{k = 0}^{j - 2}N_{i}^{k,{j - 1}}} + \left( {\sum\limits_{k = i}^{m}N_{j}^{{i - 1},k}} \right)^{T} - {\left( {\sum\limits_{k = 0}^{i - 2}N_{j}^{k,{j - 1}}} \right)^{T}i}} = 2}},3,\ldots\mspace{14mu},{m - 1},{j = {i + 2}},{i + 3},\ldots\mspace{14mu},m,{m + 1}} & \; \\ {S_{1,{m + 1}} = {{PA}_{m} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)A_{0}^{T}W_{k,l}A_{m}}}} - {\sum\limits_{k = 0}^{m - 1}N_{1}^{k,m}} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)X_{1,{m + 1}}^{k,l}}}} + \left( {\sum\limits_{k = 1}^{m}N_{m + 1}^{0,k}} \right)^{T}}} & \; \\ {{S_{i,{m + 1}} = {{{\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)A_{i - 1}^{T}W_{k,l}A_{m}}}} + \left( {\sum\limits_{k = i}^{m}N_{m + 1}^{{i - 1},k}} \right)^{T} - {\sum\limits_{k = 0}^{m - 1}N_{l}^{k,m}} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{l = {k + 1}}^{m}{\left( {\tau_{l} - \tau_{k}} \right)X_{i,{m + 1}}^{k,l}}}} - {\left( {\sum\limits_{k = 0}^{i - 2}N_{m + 1}^{k,m}} \right)^{T}i}} = 2}},3,\ldots\mspace{14mu},{m - 1},m} & \; \\ {X_{i,j} = \begin{bmatrix} X_{i,j}^{1,1} & \ldots & X_{1,m}^{i,j} & X_{1,{m + 1}}^{i,j} \\ \vdots & \ddots & \ldots & \ldots \\ \left( X_{1,m}^{i,j} \right)^{T} & \vdots & X_{m,m}^{i,j} & X_{m,{m + 1}}^{i,j} \\ \left( X_{1,{m + 1}}^{i,j} \right)^{T} & \vdots & \left( X_{m,{m + 1}}^{i,j} \right)^{T} & X_{{m + 1},{m + 1}}^{i,j} \end{bmatrix}} & \; \\ {{X_{k,l}^{i,j} \in R^{n \times n}},{0 \leq i < j < m},{0 \leq k < l < {m + 1}}} & \; \\ {M_{i,j} = {\begin{bmatrix} X_{1,1}^{i,j} & \ldots & X_{1,{m + 1}}^{i,j} & N_{1}^{i,j} \\ \vdots & \ddots & \ldots & \ldots \\ \left( X_{1,{m + 1}}^{i,j} \right)^{T} & \vdots & X_{{m + 1},{m + 1}}^{i,j} & N_{m + 1}^{i,j} \\ \left( N_{1}^{i,j} \right)^{T} & \vdots & \left( N_{m + 1}^{i,j} \right)^{T} & W_{i,j} \end{bmatrix}.}} & \; \end{matrix}$

Criterion 2 is a multi-delay stability criterion for the power system not containing free-weighting matrices.

Criterion 2: For a system with m time delays, if there exist positive definite matrices P∈R^(n×n) and Q_(i)∈R^(n×n) (where i=1, 2, . . . , m) and semi-positive definite matrices W_(i,j)∈R^(n×n) (where i=1, 2, . . . , m), the following matrix inequality is established:

$\begin{matrix} {{{H = {\begin{bmatrix} H_{1,1} & \ldots & H_{1,m} & H_{1,{m + 1}} \\ \vdots & \ddots & \ldots & \ldots \\ H_{1,m}^{T} & \vdots & H_{m,m} & H_{m,{m + 1}} \\ H_{1,{m + 1}}^{T} & \vdots & H_{m,{m + 1}}^{T} & H_{{m + 1},{m + 1}} \end{bmatrix} < O}},{{where}\text{:}}}{H_{1,1} = {{PA_{0}} + {A_{0}^{T}P} + {\overset{m}{\sum\limits_{k = 1}}Q_{k}} + {\overset{m}{\sum\limits_{k = 1}}{\left( {\tau_{k} - \tau_{k - 1}} \right)^{2}A_{0}^{T}W_{k}A_{0}}} - W_{1}}}{{H_{i,i} = {{- Q_{i - 1}} + {\sum\limits_{k = 1}^{m}{\left( {\tau_{k} - \tau_{k - 1}} \right)^{2}A_{i - 1}^{T}W_{k}A_{i - 1}}} - W_{i} - W_{i - 1}}},{i = 2},3,\ldots\mspace{14mu},{m - 1},m}{H_{{m + 1},{m + 1}} = {{- Q_{m}} + {\sum\limits_{k = 1}^{m}{\left( {\tau_{k} - \tau_{k - 1}} \right)^{2}A_{m}^{T}W_{k}A_{m}}} - W_{m}}}{H_{1,2} = {{PA_{1}} + {\sum\limits_{k = 1}^{m}{\left( {\tau_{k} - \tau_{k - 1}} \right)^{2}A_{0}^{T}W_{k}A_{1}}} + W_{1}}}{{H_{i,{i + 1}} = {{\sum\limits_{k = 1}^{m}{\left( {\tau_{k} - \tau_{k - 1}} \right)^{2}A_{i - 1}^{T}W_{k}A_{i}}} + W_{i}}},{i = 2},3,\ldots\mspace{14mu},{m - 1},m}{{H_{i,j} = {{PA}_{j - 1} + {\sum\limits_{k = 1}^{m}{\left( {\tau_{k} - \tau_{k - 1}} \right)^{2}A_{0}^{T}W_{k}A_{j - 1}}}}},{j = 3},4,\ldots\mspace{14mu},m,{m + 1}}{{H_{i,j} = {\sum\limits_{k = 1}^{m}{\left( {\tau_{k} - \tau_{k - 1}} \right)^{2}A_{i - 1}^{T}W_{k}A_{j - 1}}}},{2 \leq i < {i + 2} \leq j \leq {m + {1.}}}}} & (30) \end{matrix}$

Criterion 3 is a multi-delay stability criterion for the power system with quadratic integral terms.

Criterion 3: If there exist positive definite matrices P∈R^((2m+1)n×(2m+1)n), U_(i)∈R^(n×n) and Y_(i)∈R^(2n×2n) and semi-positive definite matrices Q_(i)∈R^(2n×2n) and Z_(i)∈R^(2×2), (where i=1, 2, . . . , m), the following matrix is negative definite as:

${\left( {{C_{1}{PC}_{2}^{T}} + {C_{2}PC_{1}^{T}}} \right) + {\sum\limits_{i = 1}^{m}\left\{ {{\left\lbrack {e_{1}\mspace{14mu} A_{c}^{T}} \right\rbrack{\left( {Q_{i} + {\tau_{i}^{2}Z_{i}}} \right)\begin{bmatrix} e_{1}^{T} \\ A_{c} \end{bmatrix}}} - {\left\lbrack {{e_{i + {2m} + 1}\mspace{14mu} e_{1}} - e_{i + 1}} \right\rbrack{Z_{i}\begin{bmatrix} e_{i + {2m} + 1}^{T} \\ {e_{1}^{T} - e_{i + 1}^{T}} \end{bmatrix}}} - {2\left( {{\tau_{i}e_{1}} - e_{i + {2m} + 1}} \right){U_{i}\left( {{\tau_{i}e_{1}^{T}} - e_{i + {2m} + 1}^{T}} \right)}} + {\frac{1}{2}\tau_{i}^{4}A_{c}^{T}U_{i}A_{c}} - {\left\lbrack {e_{i + 1}\mspace{14mu} e_{i + {2m} + 1}} \right\rbrack{Q_{i}\begin{bmatrix} e_{i + 1}^{T} \\ e_{i + {2m} + 1}^{T} \end{bmatrix}}}} \right\}} + {\sum\limits_{i = 2}^{m}\left\{ {{{\left( {\tau_{i} - \tau_{i - 1}} \right)^{2}\left\lbrack {e_{1}\mspace{14mu} A_{c}^{T}} \right\rbrack}{Y_{i - 1}\begin{bmatrix} e_{1}^{T} \\ A_{c} \end{bmatrix}}} - {\left\lbrack {e_{i + {2m} + 1} - {e_{i + {2m}}\mspace{14mu} e_{i}} - e_{i + 1}} \right\rbrack{Y_{i - 1}\begin{bmatrix} {e_{i + {2m} + 1}^{T} - e_{i + {2m}}^{T}} \\ {e_{i}^{T} - e_{i + 1}^{T}} \end{bmatrix}}}} \right\}}},$

so the power system with m time delays is asymptotically stable, where:

A _(c)=[A ₀ A ₁ A ₂ . . . A _(m−1) A _(m) O . . . O],

C ₁=[e ₁ e ₂ e ₃ . . . e _(m) e _(m+1) e _(m+2) e _(2m+2) e _(2m+3) . . . e _(3m) e _(3m+1)],

C ₂=[A _(c) ^(T) e _(m+2) e _(m+3) . . . e _(2m) e _(2m+1) e ₁ −e ₂ e ₁ −e ₃ . . . e ₁ −e _(m) e ₁ −e _(m+1)].

FIG. 1 shows the time-delay stability margin obtained by direct solution, and FIG. 2 shows the time-delay stability margin obtained by the JTS fast solution method.

It can be seen from FIGS. 1, 2 that the time-delay stability margin of the WSCC 3-generator-9-bus power system obtained by the JTS fast solution method almost consistent with the curves obtained by the direct solution, expect for very few points.

To compare the time consumption of the criteria, the parameter θ and the Calculation Efficiency Increasing Rate (CEIR) are defined as follows:

$\begin{matrix} {\theta = {{{arc}\tan}\;\frac{\tau_{2}}{\tau_{1}}}} & (24) \\ {{CEIR} = {\left( {\frac{{time}\mspace{14mu}{consumption}\mspace{14mu}{for}\mspace{14mu}{the}\mspace{14mu}{direction}\mspace{14mu}{solution}}{{time}\mspace{14mu}{consumption}\mspace{14mu}{for}\mspace{14mu}{the}\mspace{14mu}{JTS}\mspace{14mu}{solution}} - 1} \right) \times 100\%}} & (25) \end{matrix}$

As θ increases from 0° to 90°, Table 1 shows the corresponding calculation time and CEIR value.

TABLE 1 Comparison of the calculation time of the WSCC 3-generator-9-bus power system Criterion 1 Criterion 2 Criterion 3 Time Time Time Time Time Time consumption consumption consumption consumption consumption consumption for the for the for the for the for the for the θ direct JTS direct JTS direct JTS CEIR (°) solution (s) solution (s) CEIR (%) solution (s) solution (s) CEIR (%) solution (s) solution (s) (%) 0 1684.74 5.25 31990.29 4.01 0.18 2127.78 1520.45 32.26 4613.11 5 797.08 7.35 10744.63 4.94 0.28 1664.29 1449.73 51.45 2717.75 10 760.27 7.51 10023.44 5.13 0.27 1800.00 1189.73 53.69 2115.92 15 764.67 7.85 9641.02 5.03 0.27 1762.96 1183.96 53.51 2123.81 20 955.95 8.16 11615.07 4.98 0.25 1892.00 1173.72 54.23 2064.34 25 988.62 7.82 12542.20 4.71 0.25 1784.00 1308.21 50.94 2468.14 30 1069.53 7.20 14754.58 4.74 0.25 1796.00 1178.65 52.80 2132.29 35 1086.09 7.20 14984.58 4.88 0.26 1776.92 1236.65 53.31 2219.73 40 1135.73 6.40 17645.78 4.84 0.26 1761.54 1177.16 49.80 2263.78 45 1554.47 5.16 30025.39 5.05 0.15 3266.67 1457.12 35.10 4051.34 50 756.22 5.47 13724.86 4.68 0.27 1633.33 1294.02 51.33 2420.98 55 1098.28 5.42 20163.47 4.96 0.26 1807.69 1202.27 50.55 2278.38 60 1059.77 5.32 19820.49 4.68 0.27 1633.33 1193.42 50.26 2274.49 65 1093.70 5.83 18659.86 4.50 0.28 1507.14 1351.91 52.34 2482.94 70 1099.70 6.21 17608.53 4.65 0.26 1688.46 1233.85 49.49 2393.13 75 1065.65 6.18 17143.53 4.66 0.30 1453.33 1202.73 53.05 2167.16 80 1026.90 5.87 17394.04 4.64 0.29 1500.00 1187.11 50.97 2229.04 85 990.41 4.95 19908.28 4.42 0.28 1478.57 1124.02 54.34 1968.49 90 1886.84 4.69 40131.13 2.99 0.15 1893.33 1428.35 36.98 3762.49

It can be seen from Table 1 that the calculation time can be greatly reduced by simplifying the WSCC 3-generator-9-bus power system with multiple time delays by the JTS fast solution method of the present invention and then calculating the time-delay stability margin by the stability criteria. When θ varies from 0° to 90°, the maximum value of the CEIR under the criterion 1 can reach 40131.13%, the maximum value of the CEIR under the criterion 2 can reach 3266.67%, and the maximum value of the CEIR under the criterion 3 can reach 4613.11%, so that it is indicated that the JTS method has an obvious fast determination effect.

To explore the fast solution principle of the JTS method, the calculation of the time-delay stability margin of the WSCC 3-generator-9-bus power system under the criterion 1 is taken as an example. By applied the JTS method, there are 4×4 unknown matrices, i.e., P, Q₁, Q₂, W₁, W₂, W₃, X₁₁, X₂₂, X₃₃, Y₁₁, Y₂₂, Y₃₃, Z₁₁, Z₂₂ and Z₃₃, and 4×4 unknown appropriate matrices, i.e., N₁, N₂, N₃, S₁, S₂, S₃, T₁, T₂, T₃, X₁₂, X₁₃, X₂₃, Y₁₂, Y₁₃, Y₂₃, Z₁₂, Z₁₃ and Z₂₃ to be solved in the criterion 1. Thus, the number of unknown variables N₁ is as follows:

$\begin{matrix} {{N_{1} = {{{15 \times \frac{\left( {4 + 1} \right) \times 4}{2}} + {18 \times 4 \times 4}} = {438}}}.} & (26) \end{matrix}$

For the direct solution using the criteria, there are 15 10×10 symmetric matrices and 18 10×10 appropriate matrixes among the unknown variable matrices. Thus, the number of unknown variable matrices N₂ is as follows:

$\begin{matrix} {{N_{2} = {{{15 \times \frac{\left( {{10} + 1} \right) \times 10}{2}} + {18 \times 10 \times 10}} = {2625}}}.} & (27) \end{matrix}$

The total number of unknown variables by applying the JTS method is about ⅙ of the total number of unknown variables in the case of not using the JTS method. As a result, the amount of calculation is directly reduced, and the calculation efficiency is higher. The analysis on the other two criteria is similar to the above situation. The reduction rate of the unknown variables is 83.31%, 81.82% and 83.16% under the criteria 1, 2, 3, respectively. It can be seen that, by the JTS fast solution method, the number of unknown variables can be greatly reduced and the calculation efficiency can be improved.

Referring to FIG. 1 FIG. 4, the methods and systems of the present disclosure can be implemented on one or more computers or processors. The methods and systems disclosed can utilize one or more computers or processors to perform one or more functions in one or more locations. The processing of the disclosed methods and systems can also be performed by software components. The disclosed systems and methods can be described in the general context of computer-executable instructions such as program modules, being executed by one or more computers or devices. For example, each server or computer processor can include the program modules such as mathematical construction module, simplifying module, and maximum delay calculation module, and other related modules described in the above specification. These program modules or module related data can be stored on the mass storage device of the server and one or more client devices. Each of the operating modules can comprise elements of the programming and the data management software.

The components of the server can comprise, but are not limited to, one or more processors or processing units, a system memory, a mass storage device, an operating system, a system memory, an Input/output Interface, a display device, a display interface, a network adaptor, and a system bus that couples various system components. The server and one or more power systems can be implemented over a wired or wireless network connection at physically separate locations, implementing a fully distributed system. By way of example, a server can be a personal computer, portable computer, smartphone, a network computer, a peer device, or other common network node, and so on. Logical connections between the server and one or more power systems can be made via a network, such as a local area network (LAN) and/or a general wide area network (WAN).

As used herein, the phrase at least one of A, B, and C should be construed to mean a logical (A or B or C), using a non-exclusive logical OR. It should be understood that one or more steps within a method may be executed in different order (or concurrently) without altering the principles of the present disclosure.

As used herein, the term “module” may refer to, be part of, or include an Application Specific Integrated Circuit (ASIC); an electronic circuit; a combinational logic circuit; a field programmable gate array (FPGA); a processor (shared, dedicated, or group) that executes code; other suitable hardware components that provide the described functionality; or a combination of some or all of the above, such as in a system-on-chip.

The term module may include memory (shared, dedicated, or group) that stores code executed by the processor. The term “code”, as used herein, may include software, firmware, and/or microcode, and may refer to programs, routines, functions, classes, and/or objects. The term shared, as used above, means that some or all code from multiple modules may be executed using a single (shared) processor. In addition, some or all code from multiple modules may be stored by a single (shared) memory. The term group, as used above, means that some or all code from a single module may be executed using a group of processors. In addition, some or all code from a single module may be stored using a group of memories.

The term “interface”, as used herein, generally refers to a communication tool or means at a point of interaction between components for performing data communication between the components. Generally, an interface may be applicable at the level of both hardware and software, and may be uni-directional or bi-directional interface. Examples of physical hardware interface may include electrical connectors, buses, ports, cables, terminals, and other I/O devices or components. The components in communication with the interface may be, for example, multiple components or peripheral devices of a computer system. The present disclosure relates to computer systems. As depicted in the drawings, computer components may include physical hardware components, which are shown as solid line blocks, and virtual software components, which are shown as dashed line blocks. One of ordinary skill in the art would appreciate that, unless otherwise indicated, these computer components may be implemented in, but not limited to, the forms of software, firmware or hardware components, or a combination thereof. The apparatuses, systems and methods described herein may be implemented by one or more computer programs executed by one or more processors. The computer programs include processor-executable instructions that are stored on a non-transitory tangible computer readable medium. The computer programs may also include stored data. Non-limiting examples of the non-transitory tangible computer readable medium are nonvolatile memory, magnetic storage, and optical storage.

The foregoing description of the exemplary embodiments of the present invention has been presented only for the purposes of illustration and description and is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations are possible in light of the above teaching.

The embodiments were chosen and described in order to explain the principles of the invention and their practical application so as to activate others skilled in the art to utilize the invention and various embodiments and with various modifications as are suited to the particular use contemplated. Alternative embodiments will become apparent to those skilled in the art to which the present invention pertains without departing from its spirit and scope. Accordingly, the scope of the present invention is defined by the appended claims rather than the foregoing description and the exemplary embodiments described therein. 

1-6. (canceled)
 7. A method for fast determining a time-delay stability margin of a power system, for a time-delay power system with m time delays, the method comprising: constructing a time-delay power system mathematical model via a processor; simplifying the time-delay power system by a Jordan standardization, a Taylor separation and a Schur simplification to obtain a simplified time-delay power system mathematical model via the processor to determine a time-delay stability margin of the time-delay power system; and determining a maximum time delay that the power system sustains without losing its stability via the processor.
 8. The method of claim 7, wherein the time-delay power system mathematical model includes: $\begin{matrix} \left\{ \begin{matrix} {{\frac{d{x(t)}}{dt} = {{A_{0}{x(t)}} + {\sum\limits_{i = 1}^{m}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}},{\tau_{i} > 0}} \\ {{{x\left( {t + \xi} \right)} = {h\left( {t,\xi} \right)}},{\xi \in \left\lbrack {{- {\max\left( \tau_{i} \right)}},0} \right)}} \end{matrix} \right. & (1) \end{matrix}$ where t is a time variable; x(t) is a state variable; $\frac{d{x(t)}}{dt}$ is the derivative of the state variable with regard to the time; A₀ is a non-delay coefficient matrix; A_(i) (where i=1, 2, . . . , m) is a delay coefficient matrix; m is the number of time delays; τ_(i) (where i=1, 2, . . . , m) is a delay constant of the system; τ_(i)>0 indicates that all time delays are greater than 0; x(t−τ_(i)) (where i=1, 2, . . . , m) is a delay state variable; h(t,ξ) is a historic trajectory of the state variable x(t); ξ∈[−max(τ_(i)),0) indicates that the variable ξ varies between the opposite number of the maximum value of τ_(i) and 0; and, all algebraic variables belong to a real number field R, and all vector variables belong to an n-dimension real number vector R^(n).
 9. The method of claim 8, wherein simplifying the time-delay power system includes summing up delay coefficient matrices A_(i) (where i=1, 2, . . . , m) in the claim 2; performing Jordan standardization by the sparity of the delay coefficient matrices; performing row-column transformation on the time-delay power system mathematical model according to the sparity; performing Taylor expansion on the delay state variable ź(t−τ_(i)) subjected to the row-column transformation in the step 2, separating the correlation between the non-delay variable {tilde over (z)}(t) and the delay variable {tilde over (z)}(t−τ_(i)) in the time-delay power system mathematical model that is after the Jordan standardization and the sparity row-column transformation; and simplifying the time-delay power system mathematical model by an Schur model, so that the number of state variables is decreased from n to r, and obtaining a simplified time-delay power system mathematical model.
 10. The method of claim 9, wherein obtaining a maximum time delay that the power system includes based on the time-delay stability criteria for the power system, obtaining the time-delay stability margin of the time-delay power system with m time delays by the simplified time-delay power system mathematical model obtained in the step 4, thus achieving the fast determination of the time-delay stability margin of the power system; and obtaining the maximum time delay that the power system can sustain without losing its stability.
 11. The method of claim 8, wherein constructing the time-delay power system mathematical model further comprising: constructing a differential algebraic equation set of the power system with time delays: $\begin{matrix} \left\{ {\begin{matrix} {\overset{.}{s} = {f\left( {s,s_{1},s_{2},y,y_{1},y_{2}} \right)}} \\ {0 = {g\left( {s,y} \right)}} \\ {{0 = {g\left( {s_{i},y_{i}} \right)}},\ {i = 1},2} \end{matrix},} \right. & (1) \end{matrix}$ where s∈R^(n) is an original state variable of the system, y∈R^(r) is an original algebraic variable of the system, s_(i)=s (t−τ_(i)) (where i=1, 2, . . . , m) is an original delay state variable of the system, y_(i)=y (t−τ_(i)) (where i=1, 2, . . . , m) is an original delay algebraic variable of the system; and, τ_(i)∈R (where i=1, 2, . . . , m) is a time delay constant of the system; linearizing the equation (2) in an equilibrium point (x_(e), y_(e)) to obtain: $\begin{matrix} \left\{ {\begin{matrix} {{\Delta\overset{.}{s}} = {{F_{s}\Delta\; s} + {F_{y}\Delta y} + {\Sigma_{i = 1}^{m}\left( {{F_{si}\Delta s_{i}} + {F_{yi}\Delta y_{i}}} \right)}}} \\ {0 = {{G_{s}\Delta s} + {G_{y}\Delta y}}} \\ {{0 = {{G_{si}\Delta s_{i}} + {G_{yi}\Delta y_{i}}}},\ {i = 1},2,\ldots\mspace{14mu},m} \end{matrix},{{{{wher}e}F_{s}} = \frac{\partial f}{\partial s}},{F_{y} = \frac{\partial f}{\partial y}},{G_{s} = \frac{\partial g}{\partial s}},{G_{y} = \frac{\partial g}{\partial y}},{F_{si} = \frac{\partial f}{\partial s_{i}}},{F_{yi} = \frac{\partial f}{\partial y_{i}}},{G_{si} = \frac{\partial g}{\partial s_{i}}},{{{and}\mspace{14mu} G_{yi}} = \frac{\partial g}{\partial y_{i}}},} \right. & (3) \end{matrix}$ where i=1, 2, . . . m; and, Δs, Δy, Δs_(i) and Δy_(i) are increments nearby the equilibrium point; without considering the singularity, G_(y) and G_(yi) in the equation (3) are invertible, expressing the equation (3) as: Δ{dot over (s)}=A ₀ Δs+Σ _(i=1) ^(m) A _(i) Δs(t−τ _(i))  (4), where A₀=F_(s)−F_(y)G_(s) ⁻¹G_(s) and A_(i)=F_(si)−F_(yi)G_(yi) ⁻¹G_(si); expressing the increment of the state variable by x(t)=Δz, rewriting the equation (4) as: $\begin{matrix} {{\frac{d{x(t)}}{dt} = {{A_{0}{x(t)}} + {\sum\limits_{i = 1}^{2}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}};} & (5) \end{matrix}$ and expressing the time-delay power system mathematical model as follows: $\begin{matrix} \left\{ {\begin{matrix} {{\frac{d{x(t)}}{dt} = {{A_{0}{x(t)}} + {\sum\limits_{i = 1}^{2}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}},{\tau_{i} > 0}} \\ {{{x\left( {t + \xi} \right)} = {h\left( {t,\xi} \right)}},{\xi \in \left\lbrack {{- {\max\left( \tau_{i} \right)}},0} \right)}} \end{matrix},} \right. & (6) \end{matrix}$ where t is a time variable; x(t) is a state variable; $\frac{d{x(t)}}{dt}$ is the derivative of the state variable with regard to the time; A₀ is the non-delay coefficient matrix; A_(i) (where i=1, 2, . . . , m) is a delay coefficient matrix; m is the number of time delays; τ_(i) (where i=1, 2, . . . , m) is a delay constant of the system; τ_(i)>0 indicates that all time delays are greater than 0; x (t−τ_(i)) (where i=1, 2, . . . , m) is a delay state variable; h(t,ξ) is a historic trajectory of the state variable x(t); ξ∈[−max(τ_(i)),0) indicates that the variable ξ varies between the opposite number of the maximum value of τ_(i) and 0; and, all algebraic variables belong to a real number field R, and all vector variables belong to a n-dimension real number vector R^(n).
 12. The method of claim 7, wherein simplifying the time-delay power system further comprising: accumulating the delay coefficient matrix A_(i) (where i=1, 2, . . . m) to obtain ${\sum\limits_{i = 1}^{2}A_{i}};$ performing Jordan standardization to the result of accumulation ${\sum\limits_{i = 1}^{2}A_{i}},$ that is, performing row-column transformation on the sum of the delay coefficient matrix A_(i) (where i=1, 2, . . . m): $\begin{matrix} {{{{T\left( {\sum\limits_{i = 1}^{m}A_{i}} \right)}T^{- 1}} = J},} & (7) \end{matrix}$ where T is a row-column transformation matrix; performing row-row transformation on the first equation $\frac{d{x(t)}}{dt} = {{A_{0}{x(t)}} + {\sum\limits_{i = 1}^{m}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}$ in the power system mathematical model with time delays constructed in the step 1: $\begin{matrix} {{\frac{dT{x(t)}}{dt} = {{TA_{0}{x(t)}} + {T{\sum\limits_{i = 1}^{m}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}}};} & (8) \end{matrix}$ performing variable substitution on the state variable x(t), setting Tx(t)=z(t), and substituting x(t)=T⁻¹z(t) and x(t−τ_(i))=T⁻¹z(t−τ_(i)) into the equation (8) to obtain: $\begin{matrix} {{\frac{d{z(t)}}{dt} = {{A_{0J}{z(t)}} + {\sum\limits_{i = 1}^{m}{A_{iJ}{z\left( {t - \tau_{i}} \right)}}}}};} & (9) \end{matrix}$ where A_(0J)=TA₀T⁻¹ and ${A_{iJ} = {{{T\left( {\sum\limits_{i = 1}^{m}A_{i}} \right)}T^{- 1}} = J}};$ and according to the sparity of the delay coefficient matrix A_(iJ) in the equation (9), performing row-column transformation on the delay coefficient matrix A_(iJ) based on the following transformation rule: for any variable z_(k) (where 1≤k≤n), if the value of an element A_(iJ) (i, j) or A_(iJ) (j,i) (where 1≤i≤m and 1≤j≤n) in A_(iJ) is 0, successively arranging the variable z_(k) as the last variable in the sequence of stage variables to obtain a rearranged state variable {tilde over (z)}(t)=[{tilde over (z)}^(T) _(res)(t) {tilde over (z)}^(T) _(unres)(t)]^(T), where {tilde over (z)}_(res)(t)∈R⁴ and {tilde over (z)}_(unres)(t)∈R^(n−r); hence, obtaining the following equation according to the transformation rule: $\begin{matrix} {{\begin{bmatrix} {{\overset{.}{\overset{\sim}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{\sim}{z}}}_{unres}(t)} \end{bmatrix} = {{{{\overset{\sim}{A}}_{0}\begin{bmatrix} {{\overset{\sim}{z}}_{res}(t)} \\ {{\overset{\sim}{z}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{i = 1}^{m}{{{\overset{\sim}{A}}_{i}\begin{bmatrix} {{\overset{\sim}{z}}_{res}\left( {t - \tau_{i}} \right)} \\ {{\overset{\sim}{z}}_{unres}\left( {t - \tau_{i}} \right)} \end{bmatrix}}{where}\mspace{14mu}{\overset{\sim}{A}}_{i}}}} = \left\lbrack \begin{matrix} {\overset{\sim}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{matrix} \right\rbrack}};} & (10) \end{matrix}$ and expressing the time-delay power system mathematical model subjected to the Jordan standardization and sparity row-column transformation as follows: $\begin{matrix} \left\{ {\begin{matrix} {{\frac{d{\overset{˜}{z}(t)}}{dt} = {{{\overset{˜}{A}}_{0}{\overset{˜}{z}(t)}} + {\sum\limits_{i = 1}^{m}{{\overset{˜}{A}}_{i}{\overset{˜}{z}\left( {t - \tau_{i}} \right)}}}}},{\tau_{i} > 0}} \\ {{{\overset{˜}{z}\left( {t + \xi} \right)} = {\overset{˜}{h}\left( {t,\xi} \right)}},{\xi \in \left\lbrack {{- \tau_{i}},0} \right)}} \end{matrix}.} \right. & (11) \end{matrix}$
 13. The method of claim 9, wherein performing Taylor expansion further includes: performing Taylor expansion on the delay state variable {tilde over (z)}(t−τ_(i)) in the equation (11): $\begin{matrix} {{\begin{bmatrix} {{\overset{\sim}{z}}_{res}\left( {t - \tau_{i}} \right)} \\ {{\overset{\sim}{z}}_{unres}\left( {t - \tau_{i}} \right)} \end{bmatrix} = {\begin{bmatrix} {{\overset{\sim}{z}}_{res}(t)} \\ {{\overset{\sim}{z}}_{unres}(t)} \end{bmatrix} - {\tau_{i}\begin{bmatrix} {{\overset{.}{\overset{\sim}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{\sim}{z}}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{l = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{\sim}{z}}_{res}^{(l)}(t)} \\ {{\overset{\sim}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}}}};} & (12) \end{matrix}$ substituting the first equation $\frac{d{\overset{\sim}{z}(t)}}{dt} = {{{\overset{˜}{A}}_{0}{\overset{˜}{z}(t)}} + {\sum\limits_{i = 1}^{m}{{\overset{˜}{A}}_{i}{\overset{˜}{z}\left( {t - \tau_{i}} \right)}}}}$ in the equation (11) into the equation (12) to obtain: $\begin{matrix} {{\begin{bmatrix} {{\overset{.}{\overset{\sim}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{\sim}{z}}}_{unres}(t)} \end{bmatrix} = {{{\overset{\sim}{A}}_{0}\begin{bmatrix} {{\overset{\sim}{z}}_{res}(t)} \\ {{\overset{\sim}{z}}_{unres}(t)} \end{bmatrix}}{\sum\limits_{i = 1}^{m}{{\overset{\sim}{A}}_{i}\left\{ {\begin{bmatrix} {{\overset{\sim}{z}}_{res}(t)} \\ {{\overset{\sim}{z}}_{unres}(t)} \end{bmatrix} - {\tau_{i}\begin{bmatrix} {{\overset{.}{\overset{\sim}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{\sim}{z}}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{l = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{\sim}{z}}_{res}^{(l)}(t)} \\ {{\overset{\sim}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}}} \right\}}}}};} & (13) \end{matrix}$ combining similar variables in the equation (13): $\begin{matrix} {{{\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\} \cdot \begin{bmatrix} {{\overset{.}{\overset{\sim}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{\sim}{z}}}_{unres}(t)} \end{bmatrix}} = {{\left\{ {{\overset{˜}{A}}_{0} + {\sum\limits_{i = 1}^{m}\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}} \right\} \cdot \begin{bmatrix} {{\overset{\sim}{z}}_{res}(t)} \\ {{\overset{\sim}{z}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{i = 1}^{m}{\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix} \cdot \left\{ {\sum\limits_{i = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{˜}{z}}_{res}^{(l)}(t)} \\ {{\overset{˜}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}} \right\}}}}},} & (14) \end{matrix}$ where, since $\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}$ is invertible, multiplying both sides of the equation (14) by the inverse matrix of $\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}$ to obtain a time-delay power system mathematical model subjected to the Taylor separation: $\begin{matrix} {\begin{bmatrix} {{\overset{.}{\overset{\sim}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{\sim}{z}}}_{unres}(t)} \end{bmatrix} = {{{\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{\infty}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}^{- 1} \cdot \left\{ {{\overset{˜}{A}}_{0} + {\sum\limits_{i = 1}^{m}\begin{bmatrix} {\overset{˜}{A}}_{0}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}} \right\} \cdot \begin{bmatrix} {{\overset{\sim}{z}}_{res}(t)} \\ {{\overset{\sim}{z}}_{unres}(t)} \end{bmatrix}} + {\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}^{- 1} \cdot {\sum\limits_{i = 1}^{m}{\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix} \cdot \left\{ {\sum\limits_{i = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{˜}{z}}_{res}^{(l)}(t)} \\ {{\overset{˜}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}} \right\}}}}} = {{\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}^{- 1} \cdot \left\{ {{\overset{˜}{A}}_{0} + {\sum\limits_{i = 1}^{m}\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}} \right\} \cdot \begin{bmatrix} {{\overset{\sim}{z}}_{res}(t)} \\ {{\overset{\sim}{z}}_{unres}(t)} \end{bmatrix}} + {\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}^{- 1} \cdot {\sum\limits_{i = 1}^{m}{\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} \\ O_{{({n - r})} \times r} \end{bmatrix} \cdot {\left\{ {\sum\limits_{i = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{˜}{z}}_{res}^{(l)}(t)} \\ {{\overset{˜}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}} \right\}.}}}}}}} & (15) \end{matrix}$
 14. The method of claim 9, wherein simplifying the time-delay power system mathematical model by an Schur model further includes converting the time-delay power system mathematical model subjected to the Taylor separation into an input-output form: $\begin{matrix} \left\{ {\begin{matrix} {{\overset{.}{\overset{\sim}{z}}(t)} = {{{\overset{\_}{A}}_{0}{\overset{\sim}{z}(t)}} + {{\overset{\_}{B}}_{0}{u(t)}}}} \\ {{y(t)} = {\left\lbrack {I_{r \times r}\mspace{14mu} O_{r \times {({n - r})}}} \right\rbrack{\overset{\sim}{z}(t)}}} \end{matrix},{{{where}\text{:}{\overset{\_}{A}}_{0}} = {{{\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}^{- 1} \cdot \left\{ {{\overset{˜}{A}}_{0} + {\sum\limits_{i = 1}^{m}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}} \right\}}{\overset{\_}{B}}_{0}} = {{\left\lbrack {{\overset{\_}{B}}_{1}\mspace{14mu}{\overset{\_}{B}}_{2}\mspace{14mu}\ldots\mspace{20mu}{\overset{\_}{B}}_{i}\mspace{14mu}\ldots\mspace{20mu}{\overset{\_}{B}}_{m - 1}\mspace{14mu}{\overset{\_}{B}}_{m}} \right\rbrack{\overset{\_}{B}}_{i}} = {\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}^{- 1} \cdot {\sum\limits_{i = 1}^{m}\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} \\ O_{{({n - r})} \times r} \end{bmatrix}}}}}},{i = 1},2,\ldots\mspace{14mu},{{mu} = \left\lbrack {u_{1}^{T}\mspace{14mu} u_{2}^{T}\mspace{14mu}\ldots\mspace{14mu} u_{i}^{T}\mspace{14mu}\ldots\mspace{14mu} u_{m - 1}^{T}\mspace{14mu} u_{m}^{T}} \right\rbrack^{T}},{i = 1},2,\ldots\mspace{14mu},{{{m{u_{i}(t)}} = {\sum\limits_{l = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}{{\overset{˜}{z}}_{res}^{(i)}(t)}}}};}} \right. & (16) \end{matrix}$ performing Schur simplification in the equation (16) to decrease the number of state variables from n to r: $\begin{matrix} \left\{ {\begin{matrix} {{{\overset{.}{z}}_{red}(t)} = {{A_{red}{z_{red}(t)}} + {B_{red}{u(t)}}}} \\ {{y(t)} = {C_{red}{z_{red}(t)}}} \end{matrix},} \right. & (17) \end{matrix}$ where z_(red)(t)∈R^(r), y(t)∈R^(r), A_(red)∈R^(r×r), B_(red,i)∈R^(r×r), C_(red)∈R^(r×r), and B_(red)=[B_(red,1), B_(red,2) . . . B_(red,i) . . . B_(red,m−1) B_(red,m)]; in accordance with the equation (16), substituting y(t)={tilde over (z)}_(res)(t) into the equation (17): $\begin{matrix} \left\{ {\begin{matrix} {{{\overset{.}{z}}_{red}(t)} = {{A_{red}{z_{red}(t)}} + {B_{red}{u(t)}}}} \\ {{{\overset{\sim}{z}}_{res}(t)} = {C_{red}{z_{red}(t)}}} \end{matrix};} \right. & (18) \end{matrix}$ substituting the second equation {tilde over (z)}_(res)(t)=C_(red)z_(red)(t) in the equation (18) into the first equation ź_(red)(t)=A_(red)z_(red)(t)+B_(red)u(t) to obtain: $\begin{matrix} {{{{\overset{.}{\overset{\sim}{z}}}_{res}(t)} = \left. {{C_{red}A_{red}C_{red}^{- 1}{{\overset{\sim}{z}}_{res}(t)}} + {C_{red}B_{red}{u(t)}}} \right|};} & (19) \end{matrix}$ expanding each input component u_(i)(t) of input u(t) in the equation (16) according to the Taylor separation: $\begin{matrix} {{{u_{i}(t)} = {\sum\limits_{l = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}{{\overset{˜}{z}}_{res}^{(i)}(t)}}}}{{{u_{i}(t)} = {{{\sum\limits_{l = 0}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}{{\overset{˜}{z}}_{res}^{(l)}(t)}}} - {{\overset{˜}{z}}_{res}^{(0)}(t)} - {\frac{\left( {- \tau_{i}} \right)^{1}}{1!}{{\overset{˜}{z}}_{res}^{(1)}(t)}{u_{i}(t)}}} = {{{\overset{˜}{z}}_{res}\left( {t - \tau_{i}} \right)} - {{\overset{˜}{z}}_{res}(t)} + {\tau_{i}{{\overset{\overset{.}{˜}}{z}}_{res}(t)}}}}};}} & (20) \end{matrix}$ and substituting all input components into the equation (18) to eventually obtain a simplified time-delay power system mathematical model: $\begin{matrix} \left\{ {\begin{matrix} {\frac{d{{\overset{\sim}{z}}_{res}(t)}}{dt} = {{A_{0,{res}}{{\overset{\sim}{z}}_{res}(t)}} + {\sum\limits_{i = 1}^{m}{A_{i,{res}}{{\overset{\sim}{z}}_{res}\left( {t - \tau_{i}} \right)}}}}} \\ {{{x\left( {t + \xi} \right)} = {h\left( {t,\xi} \right)}},{\xi \in \left\lbrack {{- {\max\left( \tau_{i} \right)}},0} \right)}} \end{matrix},{{{where}A_{0,{res}}} = {\left( {I_{r \times r} - {\sum\limits_{i = 1}^{m}{\tau_{i}C_{red}B_{{red},i}}}} \right)^{- 1}\left( {{C_{red}A_{red}C_{red}^{- 1}} - {\sum\limits_{i = 1}^{m}{C_{red}B_{{red},i}}}} \right)}},{A_{i,{res}} = {\left( {I_{r \times r} - {\sum\limits_{i = 1}^{m}{\tau_{i}C_{red}B_{{red},i}}}} \right)^{- 1}C_{red}{B_{{red},i}.}}}} \right. & (21) \end{matrix}$
 15. The method of claim 10, wherein the time-delay stability criteria for the power system comprises one of the following two situations: (1) Layapunov stability criteria; and (2) eigenvalue analysis stability criteria.
 16. A system for fast determining a time-delay stability margin of a power system, for a time-delay power system with m time delays, the system comprising: a processor configured for: constructing a time-delay power system mathematical model via a processor; simplifying the time-delay power system by a Jordan standardization, a Taylor separation and a Schur simplification to obtain a simplified time-delay power system mathematical model to determine a time-delay stability margin of the time-delay power system; and determining a maximum time delay that the power system sustains without losing its stability via the processor; and a memory configured to be in signal communication with the processor, wherein the processor is configured for: storing the time-delay power system mathematical model and simplified time-delay power system mathematical model, the time-delay stability margin and determined maximum time delay of the power system.
 17. The system of claim 16, wherein the time-delay power system mathematical model includes: $\begin{matrix} \left\{ \begin{matrix} {{\frac{d{x(t)}}{dt} = {{A_{0}{x(t)}} + {\sum\limits_{i = 1}^{m}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}},{\tau_{i} > 0}} \\ {{{x\left( {t + \xi} \right)} = {h\left( {t,\xi} \right)}},{\xi \in \left\lbrack {{- {\max\left( \tau_{i} \right)}},0} \right)}} \end{matrix} \right. & (1) \end{matrix}$ where t is a time variable; x(t) is a state variable; $\frac{d{x(t)}}{dt}$ is the derivative of the state variable with regard to the time; A₀ is a non-delay coefficient matrix; A_(i) (where i=1, 2, . . . , m) is a delay coefficient matrix; m is the number of time delays; τ_(i) (where i=1, 2, . . . , m) is a delay constant of the system; τ_(i)>0 indicates that all time delays are greater than 0; x (t−τ_(i)) (where i=1, 2, . . . , m) is a delay state variable; h(t,ξ) is a historic trajectory of the state variable x(t); ξ∈[−max(τ_(i)),0) indicates that the variable ξ varies between the opposite number of the maximum value of τ_(i) and 0; and, all algebraic variables belong to a real number field R, and all vector variables belong to an n-dimension real number vector R^(n).
 18. The system of claim 17, wherein simplifying the time-delay power system includes summing up delay coefficient matrices A_(i) (where i=1, 2, . . . , m) in the claim 2; performing Jordan standardization by the sparity of the delay coefficient matrices; performing row-column transformation on the time-delay power system mathematical model according to the sparity; performing Taylor expansion on the delay state variable {tilde over (z)}(t−τ_(i)) subjected to the row-column transformation in the step 2, separating the correlation between the non-delay variable {tilde over (z)}(t) and the delay variable {tilde over (z)}(t−τ_(i)) in the time-delay power system mathematical model that is after the Jordan standardization and the sparity row-column transformation; and simplifying the time-delay power system mathematical model by an Schur model, so that the number of state variables is decreased from n to r, and obtaining a simplified time-delay power system mathematical model.
 19. The system of claim 17, wherein obtaining a maximum time delay that the power system includes based on the time-delay stability criteria for the power system, obtaining the time-delay stability margin of the time-delay power system with m time delays by the simplified time-delay power system mathematical model obtained in the step 4, thus achieving the fast determination of the time-delay stability margin of the power system; and obtaining the maximum time delay that the power system can sustain without losing its stability.
 20. The system of claim 17, wherein constructing the time-delay power system mathematical model further comprising: constructing a differential algebraic equation set of the power system with time delays: $\begin{matrix} \left\{ {\begin{matrix} {\overset{.}{s} = {f\left( {s,s_{1},s_{2},y,\ y_{1},y_{2}} \right)}} \\ {0 = {g\left( {s,y} \right)}} \\ {{0 = {g\left( {s_{i},y_{i}} \right)}},\ {i = 1},2} \end{matrix},} \right. & (1) \end{matrix}$ where s∈R^(n) is an original state variable of the system, y∈R^(r) is an original algebraic variable of the system, s_(i)=s(t−τ_(i)) (where i=1, 2, . . . , m) is an original delay state variable of the system, y_(i)=y(t−τ_(i)) (where i=1, 2, . . . , m) is an original delay algebraic variable of the system; and, τ_(i)∈R (where i=1, 2, . . . , m) is a time delay constant of the system; linearizing the equation (2) in an equilibrium point (x_(e), y_(e)) to obtain: $\begin{matrix} \left\{ {\begin{matrix} {{\Delta\overset{.}{s}} = {{F_{s}{\Delta s}} + {F_{y}\Delta y} + {\Sigma_{i = 1}^{m}\left( {{F_{si}\Delta s_{i}} + {F_{yi}\Delta y_{i}}} \right)}}} \\ {0 = {{G_{s}\Delta s} + {G_{y}\Delta y}}} \\ {{0 = {{G_{si}\Delta s_{i}} + {G_{yi}\Delta y_{i}}}},\ {i = 1},2,\ldots\mspace{14mu},m} \end{matrix},{{{where}\mspace{14mu} F_{s}} = \frac{\partial f}{\partial s}},{F_{y} = \frac{\partial f}{\partial y}},{G_{s} = \frac{\partial g}{\partial s}},{G_{y} = \frac{\partial g}{\partial y}},{F_{si} = \frac{\partial f}{\partial s_{i}}},{F_{yi} = \frac{\partial f}{\partial y_{i}}},{G_{si} = \frac{\partial g}{\partial s_{i}}},{{{and}\mspace{14mu} G_{yi}} = \frac{\partial g}{\partial y_{i}}},} \right. & (3) \end{matrix}$ where i=1, 2, . . . m; and, Δs, Δy, Δs_(i) and Δy_(i) are increments nearby the equilibrium point; without considering the singularity, G_(y) and G_(yi) in the equation (3) are invertible, expressing the equation (3) as: Δ{dot over (s)}=A ₀ Δs+Σ _(i=1) ^(m) A _(i) Δs(t−τ _(i))  (4), where A₀=F_(s)−F_(y)G_(y) ⁻¹G_(s) and A_(i)=F_(si)−F_(yi)G_(yi) ⁻¹G_(si); expressing the increment of the state variable by x(t)=Δz, rewriting the equation (4) as: $\begin{matrix} {{\frac{d{x(t)}}{dt} = {{A_{0}{x(t)}} + {\overset{2}{\sum\limits_{i = 1}}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}};} & (5) \end{matrix}$ and expressing the time-delay power system mathematical model as follows: $\begin{matrix} \left\{ {\begin{matrix} {{\frac{d{x(t)}}{dt} = {{A_{o}{x(t)}} + {\sum\limits_{i = 1}^{2}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}},{\tau_{i} > 0}} \\ {{{x\left( {t + \xi} \right)} = {h\left( {t,\xi} \right)}},{\xi \in \left\lbrack {{- {\max\left( \tau_{i} \right)}},0} \right)}} \end{matrix},} \right. & (6) \end{matrix}$ where t is a time variable; x(t) is a state variable; $\frac{d{x(t)}}{dt}$ is the derivative of the state variable with regard to the time; A₀ is the non-delay coefficient matrix; A_(i) (where i=1, 2, . . . , m) is a delay coefficient matrix; m is the number of time delays; τ_(i) (where i=1, 2, . . . , m) is a delay constant of the system; τ_(i)>0 indicates that all time delays are greater than 0; x (t−τ_(i)) (where i=1, 2, . . . , m) is a delay state variable; h(t,ξ) is a historic trajectory of the state variable x(t); ξ∈[−max(τ_(i)),0) indicates that the variable ξ varies between the opposite number of the maximum value of τ_(i) and 0; and, all algebraic variables belong to a real number field R, and all vector variables belong to a n-dimension real number vector R^(n).
 21. The system of claim 16, wherein simplifying the time-delay power system further comprising: accumulating the delay coefficient matrix A_(i) (where i=1, 2, . . . m) to obtain ${\sum\limits_{i = 1}^{2}A_{i}};$ performing Jordan standardization to the result of accumulation ${\sum\limits_{i = 1}^{2}A_{i}},$ that is, performing row-column transformation on the sum of the delay coefficient matrix A_(i) (where i=1, 2, . . . m): $\begin{matrix} {{{{T\left( {\sum\limits_{i = 1}^{m}A_{i}} \right)}T^{- 1}} = J},} & (7) \end{matrix}$ where T is a row-column transformation matrix; performing row-row transformation on the first equation $\frac{d{x(t)}}{dt} = {{A_{0}{x(t)}} + {\sum\limits_{i = 1}^{m}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}$ in the power system mathematical model with time delays constructed in the step 1: $\begin{matrix} {{\frac{dT{x(t)}}{dt} = {{TA_{0}{x(t)}} + {T{\sum\limits_{i = 1}^{m}{A_{i}{x\left( {t - \tau_{i}} \right)}}}}}};} & (8) \end{matrix}$ performing variable substitution on the state variable x(t), setting Tx(t)=z(t), and substituting x(t)=T⁻¹z(t) and x(t−τ_(i))=T⁻¹z(t−τ_(i)) into the equation (8) to obtain: $\begin{matrix} {{\frac{d{z(t)}}{dt} = {{A_{0J}{z(t)}} + {\sum\limits_{i = 1}^{m}{A_{iJ}{z\left( {t - \tau_{i}} \right)}}}}};} & (9) \end{matrix}$ where A_(0J)=TA₀T⁻¹ and ${A_{iJ} = {{{T\left( {\sum\limits_{i = 1}^{m}A_{i}} \right)}T^{- 1}} = J}};$ and according to the sparity of the delay coefficient matrix A_(iJ) in the equation (9), performing row-column transformation on the delay coefficient matrix A_(iJ) based on the following transformation rule: for any variable z_(k) (where 1≤k≤n), if the value of an element A_(iJ)(i, j) or A_(iJ)(j,i) (where 1≤i≤m and 1≤j≤n) in A_(iJ) is 0, successively arranging the variable z_(k) as the last variable in the sequence of stage variables to obtain a rearranged state variable {tilde over (z)}(t)=[{tilde over (z)}^(T) _(res)(t) {tilde over (z)}^(T) _(unres)(t)]^(T), where {tilde over (z)}_(res)(t)∈R⁴ and {tilde over (z)}_(unres)(t)∈R^(n−r); hence, obtaining the following equation according to the transformation rule: $\begin{matrix} {\begin{bmatrix} {{\overset{.}{\overset{\sim}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{\sim}{z}}}_{unres}(t)} \end{bmatrix} = {{{\overset{\sim}{A}}_{0}\begin{bmatrix} {{\overset{\sim}{z}}_{res}(t)} \\ {{\overset{\sim}{z}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{i = 1}^{m}{{\overset{\sim}{A}}_{i}\begin{bmatrix} {{\overset{\sim}{z}}_{res}\left( {t - \tau_{i}} \right)} \\ {{\overset{\sim}{z}}_{unres}\left( {t - \tau_{i}} \right)} \end{bmatrix}}}}} & (10) \end{matrix}$ where ${{\overset{\sim}{A}}_{i} = \begin{bmatrix} {\overset{\sim}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}};$ and expressing the time-delay power system mathematical model subjected to the Jordan standardization and sparity row-column transformation as follows: $\begin{matrix} \left\{ {\begin{matrix} {{\frac{d{\overset{˜}{z}(t)}}{dt} = {{{\overset{˜}{A}}_{0}{\overset{˜}{z}(t)}} + {\sum\limits_{i = 1}^{m}{{\overset{˜}{A}}_{i}{\overset{˜}{z}\left( {t - \tau_{i}} \right)}}}}},{\tau_{i} > 0}} \\ {{{\overset{˜}{z}\left( {t + \xi} \right)} = {\overset{˜}{h}\left( {t,\xi} \right)}},{\xi \in \left\lbrack {{- \tau_{i}},0} \right)}} \end{matrix}.} \right. & (11) \end{matrix}$
 22. The system of claim 18, wherein performing Taylor expansion further includes: performing Taylor expansion on the delay state variable {tilde over (z)}(t−τ_(i)) in the equation (11): $\begin{matrix} {{\begin{bmatrix} {{\overset{\sim}{z}}_{res}\left( {t - \tau_{i}} \right)} \\ {{\overset{\sim}{z}}_{unres}\left( {t - \tau_{i}} \right)} \end{bmatrix} = {\begin{bmatrix} {{\overset{\sim}{z}}_{res}(t)} \\ {{\overset{\sim}{z}}_{unres}(t)} \end{bmatrix} - {\tau_{i}\begin{bmatrix} {{\overset{.}{\overset{\sim}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{\sim}{z}}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{i = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{\sim}{z}}_{res}^{(l)}(t)} \\ {{\overset{\sim}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}}}};} & (12) \end{matrix}$ substituting the first equation $\frac{d{\overset{\sim}{z}(t)}}{dt} = {{{\overset{˜}{A}}_{0}{\overset{˜}{z}(t)}} + {\sum\limits_{i = 1}^{m}{{\overset{˜}{A}}_{i}{\overset{˜}{z}\left( {t - \tau_{i}} \right)}}}}$ in the equation (11) into the equation (12) to obtain: $\begin{matrix} {{\begin{bmatrix} {{\overset{.}{\overset{\sim}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{\sim}{z}}}_{unres}(t)} \end{bmatrix} = {{{\overset{\sim}{A}}_{0}\begin{bmatrix} {{\overset{\sim}{z}}_{res}(t)} \\ {{\overset{\sim}{z}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{i = 1}^{m}{{\overset{\sim}{A}}_{1}\left\{ {\begin{bmatrix} {{\overset{\sim}{z}}_{res}(t)} \\ {{\overset{\sim}{z}}_{unres}(t)} \end{bmatrix} - {\tau_{i}\begin{bmatrix} {{\overset{.}{\overset{\sim}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{\sim}{z}}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{i = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{\sim}{z}}_{res}^{(l)}(t)} \\ {{\overset{\sim}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}}} \right\}}}}};} & (13) \end{matrix}$ combining similar variables in the equation (13): $\begin{matrix} {\;{{{\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\} \cdot \begin{bmatrix} {{\overset{.}{\overset{˜}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{˜}{z}}}_{unres}(t)} \end{bmatrix}} = {{\left\{ {{\overset{˜}{A}}_{0} + {\sum\limits_{i = 1}^{m}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}} \right\} \cdot \begin{bmatrix} {{\overset{˜}{z}}_{res}(t)} \\ {{\overset{˜}{z}}_{unres}(t)} \end{bmatrix}} + {\sum\limits_{i = 1}^{m}{\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix} \cdot \left\{ {\sum\limits_{i = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{˜}{z}}_{res}^{(l)}(t)} \\ {{\overset{˜}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}} \right\}}}}},}} & (14) \end{matrix}$ where, since $\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}$ is invertible, multiplying both sides of the equation (14) by the inverse matrix of $\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}$ to obtain a time-delay power system mathematical model subjected to the Taylor separation: $\begin{matrix} {\begin{bmatrix} {{\overset{.}{\overset{˜}{z}}}_{res}(t)} \\ {{\overset{.}{\overset{˜}{z}}}_{unres}(t)} \end{bmatrix} = {{{\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}^{- 1} \cdot \left\{ {{\overset{˜}{A}}_{0} + {\sum\limits_{i = 1}^{\infty}\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}} \right\} \cdot \begin{bmatrix} {{\overset{˜}{z}}_{res}(t)} \\ {{\overset{˜}{z}}_{unres}(t)} \end{bmatrix}} + {\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}^{- 1} \cdot {\sum\limits_{i = 1}^{\infty}{\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix} \cdot \left\{ {\sum\limits_{i = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{˜}{z}}_{res}^{(l)}(t)} \\ {{\overset{˜}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}} \right\}}}}} = {{\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}^{- 1} \cdot \left\{ {{\overset{˜}{A}}_{0} + {\sum\limits_{i = 1}^{\infty}\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}} \right\} \cdot \begin{bmatrix} {{\overset{˜}{z}}_{res}(t)} \\ {{\overset{˜}{z}}_{unres}(t)} \end{bmatrix}} + {\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}^{- 1} \cdot {\sum\limits_{i = 1}^{m}{\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} \\ O_{{({n - r})} \times r} \end{bmatrix} \cdot {\left\{ {\sum\limits_{i = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}\begin{bmatrix} {{\overset{˜}{z}}_{res}^{(l)}(t)} \\ {{\overset{˜}{z}}_{unres}^{(l)}(t)} \end{bmatrix}}} \right\}.}}}}}}} & (15) \end{matrix}$
 23. The system of claim 18, wherein simplifying the time-delay power system mathematical model by an Schur model further includes converting the time-delay power system mathematical model subjected to the Taylor separation into an input-output form: $\begin{matrix} \left\{ {\begin{matrix} {{\overset{.}{\overset{\sim}{z}}(t)} = {{{\overset{\_}{A}}_{0}{\overset{\sim}{z}(t)}} + {{\overset{\_}{B}}_{0}{u(t)}}}} \\ {{y(t)} = {\left\lbrack {I_{r \times r}\mspace{14mu} O_{r \times {({n - r})}}} \right\rbrack{\overset{\sim}{z}(t)}}} \end{matrix},{{{where}\text{:}{\overset{\_}{A}}_{0}} = {{{\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}^{- 1} \cdot \left\{ {{\overset{˜}{A}}_{0} + {\sum\limits_{i = 1}^{m}\ \begin{bmatrix} {\overset{˜}{A}}_{i\; 1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}} \right\}}{\overset{\_}{B}}_{0}} = {{\left\lbrack {{\overset{\_}{B}}_{1}\mspace{14mu}{\overset{\_}{B}}_{2}\mspace{14mu}\ldots\mspace{20mu}{\overset{\_}{B}}_{i}\mspace{14mu}\ldots\mspace{20mu}{\overset{\_}{B}}_{m - 1}\mspace{14mu}{\overset{\_}{B}}_{m}} \right\rbrack{\overset{\_}{B}}_{i}} = {\left\{ {I_{n \times n} + {\sum\limits_{i = 1}^{m}{\tau_{i}\ \begin{bmatrix} {\overset{˜}{A}}_{i1}^{1} & O_{r \times {({n - r})}} \\ O_{{({n - r})} \times r} & O_{{({n - r})} \times {({n - r})}} \end{bmatrix}}}} \right\}^{- 1} \cdot {\sum\limits_{i = 1}^{m}\begin{bmatrix} {\overset{˜}{A}}_{i1}^{1} \\ O_{{({n - r})} \times r} \end{bmatrix}}}}}},{i = 1},2,\ldots\mspace{14mu},{{mu} = \left\lbrack {u_{1}^{T}\mspace{14mu} u_{2}^{T}\mspace{14mu}\ldots\mspace{14mu} u_{i}^{T}\mspace{14mu}\ldots\mspace{14mu} u_{m - 1}^{T}\mspace{14mu} u_{m}^{T}} \right\rbrack^{T}},{i = 1},2,\ldots\mspace{14mu},{{{m{u_{i}(t)}} = {\sum\limits_{l = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}{{\overset{˜}{z}}_{res}^{(i)}(t)}}}};}} \right. & (16) \end{matrix}$ performing Schur simplification in the equation (16) to decrease the number of state variables from n to r: $\begin{matrix} \left\{ {\begin{matrix} {{{\overset{.}{z}}_{red}(t)} = {{A_{red}{z_{red}(t)}} + {B_{red}{u(t)}}}} \\ {{y(t)} = {C_{red}z_{red}}} \end{matrix},} \right. & (17) \end{matrix}$ where z_(red)(t)∈R^(r), y(t)∈R^(r), A_(red)∈R^(r×r), B_(red,i)∈R^(r×r), C_(red)∈R^(r×r), and B_(red)=[B_(red,1), B_(red,2) . . . B_(red,i) . . . B_(red,m−1) B_(red,m)]; in accordance with the equation (16), substituting y(t)={tilde over (z)}_(res)(t) into the equation (17): $\begin{matrix} \left\{ {\begin{matrix} {{{\overset{.}{z}}_{red}(t)} = {{A_{red}{z_{red}(t)}} + {B_{red}{u(t)}}}} \\ {{{\overset{\sim}{z}}_{res}(t)} = {C_{red}{z_{red}(t)}}} \end{matrix};} \right. & (18) \end{matrix}$ substituting the second equation {tilde over (z)}_(res)(t)=C_(red)z_(red)(t) in the equation (18) into the first equation ź_(red)(t)=A_(red)z_(red)(t)+B_(red)u(t) to obtain: $\begin{matrix} {{{{\overset{.}{\overset{\sim}{z}}}_{res}(t)} = \left. {{C_{red}A_{red}C_{red}^{- 1}{{\overset{\sim}{z}}_{res}(t)}} + {C_{red}B_{red}{u(t)}}} \right|};} & (19) \end{matrix}$ expanding each input component u_(i)(t) of input u(t) in the equation (16) according to the Taylor separation: $\begin{matrix} {{{{u_{i}(t)} = {\sum\limits_{l = 2}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}{{\overset{˜}{z}}_{res}^{(i)}(t)}}}}{{u_{i}(t)} = {{\sum\limits_{l = 0}^{\infty}{\frac{\left( {- \tau_{i}} \right)^{l}}{l!}{{\overset{˜}{z}}_{res}^{(l)}(t)}}} - {{\overset{˜}{z}}_{res}^{(0)}(t)} - {\frac{\left( {- \tau_{i}} \right)^{1}}{1!}{{\overset{˜}{z}}_{res}^{(1)}(t)}}}}{{u_{i}(t)} = {{{\overset{˜}{z}}_{res}\left( {t - \tau_{i}} \right)} - {{\overset{˜}{z}}_{res}(t)} + {\tau_{i}{{\overset{.}{\overset{˜}{z}}}_{res}(t)}}}}};} & (20) \end{matrix}$ and substituting all input components into the equation (18) to eventually obtain a simplified time-delay power system mathematical model: $\begin{matrix} \left\{ {\begin{matrix} {\frac{d{{\overset{˜}{z}}_{res}(t)}}{dt} = {{A_{0,{res}}{{\overset{˜}{z}}_{res}(t)}} + {\sum\limits_{i = 1}^{m}{A_{i,{res}}{{\overset{˜}{z}}_{res}\left( {t - \tau_{i}} \right)}}}}} \\ {{{x\left( {t + \xi} \right)} = {h\left( {t,\xi} \right)}},{\xi \in \left\lbrack {{{- \max}\;\left( \tau_{i} \right)},0} \right)}} \end{matrix},{{{where}A_{0,{res}}} = {\left( {I_{r \times r} - {\sum\limits_{i = 1}^{m}{\tau_{i}C_{red}B_{{red},i}}}} \right)^{- 1}\left( {{C_{red}A_{red}C_{red}^{- 1}} - {\sum\limits_{i = 1}^{m}{C_{red}B_{{red},i}}}} \right)}},{A_{i,{res}} = {\left( {I_{r \times r} - {\sum\limits_{i = 1}^{m}{\tau_{i}C_{red}B_{{red},i}}}} \right)^{- 1}C_{red}{B_{{red},i}.}}}} \right. & (21) \end{matrix}$
 24. The system of claim 19, wherein the time-delay stability criteria for the power system comprises one of the following two situations: (1) Layapunov stability criteria; and (2) eigenvalue analysis stability criteria. 